POSTER: Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
نویسندگان
چکیده
We build a system that can prove, in zero knowledge, the correct executions of programs on a 32-bit RISC machine. The proofs are succinct: short and easy to verify. All previous implementations of zero-knowledge proof systems with succinct proofs (also known as zk-SNARKs) require the proof system’s keys to be regenerated for each distinct program; this is costly and requires the intervention of a trusted party. Our system is universal: no program-specific setup is required.
منابع مشابه
Succinct Non-Interactive Arguments for a von Neumann Architecture
We design and build a system that enables clients to verify the outputs of programs executed by untrusted servers. A server provides a succinct non-interactive zero-knowledge proof (also known as a zk-SNARK), which the client verifies to ascertain correct execution. The system has two components: a cryptographic proof system for verifying satisfiability of arithmetic circuits, and a circuit gen...
متن کاملSuccinct Non-Interactive Zero Knowledge for a von Neumann Architecture
We build a system that provides succinct non-interactive zero-knowledge proofs (zk-SNARKs) for program executions on a von Neumann RISC architecture. The system has two components: a cryptographic proof system for verifying satisfiability of arithmetic circuits, and a circuit generator to translate program executions to such circuits. Our design of both components improves in functionality and ...
متن کاملCalculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )
By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...
متن کاملA robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes...
متن کاملThe James and von Neumann-Jordan type constants and uniform normal structure in Banach spaces
Recently, Takahashi has introduced the James and von Neumann-Jordan type constants. In this paper, we present some sufficient conditions for uniform normal structure and therefore the fixed point property of a Banach space in terms of the James and von Neumann-Jordan type constants and the Ptolemy constant. Our main results of the paper significantly generalize and improve many known results in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014